#define _CRT_SECURE_NO_WARNINGS 1

#include <iostream>
using namespace std;
#include "BinarySearchTree.h"

int main()
{
	BSTree<int> t1;
	t1.insert(11);
	t1.insert(32);
	t1.insert(56);
	t1.insert(97);
	t1.insert(97);
	t1.insert(71);

	t1.InOrder();

	cout << endl;

	if (t1.find(97))
	{
		cout << "11 there is!" << '\n';
	}
	if (t1.find(23))
	{
		cout << "23 there is!" << '\n';
	}

	if (t1.erase(97))
	{
		cout << "11 there isn't!" << '\n';
	}
	if (t1.find(23))
	{
		cout << "23 there isn't!" << '\n';
	}

	return 0;
}